On Graph-Based Symmetric Clusters with Single-Switch Latency
نویسنده
چکیده
Cluster computing is now an accepted form of supercomputing. A cluster is a collection of computer (node) interconnected by a high-speed network. Each cluster node is either a workstation, a personal computer (PC), or a symmetric multiprocessor (SMP). The performance of a cluster system depends mainly on the bandwidth and latency of the network. In this paper, we propose a two new designs for a cluster topology that is symmetric with a single-switch latency. The cluster is constructed based on some copies of isomorphic graphs. We present some examples of this cluster. These examples have high bisection bandwidth and wide pair-wise bandwidth.
منابع مشابه
A Graph-Based Clustering Approach to Identify Cell Populations in Single-Cell RNA Sequencing Data
Introduction: The emergence of single-cell RNA-sequencing (scRNA-seq) technology has provided new information about the structure of cells, and provided data with very high resolution of the expression of different genes for each cell at a single time. One of the main uses of scRNA-seq is data clustering based on expressed genes, which sometimes leads to the detection of rare cell populations. ...
متن کاملA Graph-Based Clustering Approach to Identify Cell Populations in Single-Cell RNA Sequencing Data
Introduction: The emergence of single-cell RNA-sequencing (scRNA-seq) technology has provided new information about the structure of cells, and provided data with very high resolution of the expression of different genes for each cell at a single time. One of the main uses of scRNA-seq is data clustering based on expressed genes, which sometimes leads to the detection of rare cell populations. ...
متن کاملA Proposed Topology for a 192-Processor Symmetric Cluster with a Single-Switch Delay
Cluster computing is becoming an accepted form of supercomputing in the academe, government and industries around the world. The Ateneo High Performance Computing Group (AHPCG) proposes a design for building a 192processor cluster using a symmetric and flat networking neighborhood. A routing schema will also be developed to maximize this network topology. This design aims to demonstrate this ne...
متن کاملHigh-performance Algorithms and Applications for Smp Clusters
The future of high-performance computing relies on the efficient and scalable use of clusters with symmetric multiprocessor (SMP) nodes and low-latency, high-bandwidth interconnection networks. Current examples of such platforms include Sun Ultra HPC machines, Compaq AlphaServers with Quadrics switches, SGI Origins, and the IBM SP system with SMP nodes. Moreover, the future of NASA missioncriti...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007